Capacitated Vehicle Routing Problem In Optimization Of Waste Truck Routes Using The Particle Swarm Optimization Algorithm

نویسندگان

چکیده

In this research process, the aim is to determine shortest route for transporting waste with or minimum total distance. case, what must be considered transportation of waste, regarding distance between location source landfills. The problem routes can made in a mathematical method. method used Capacitated Vehicle Routing Problem (CVRP) solving using CVRP method, minimized optimized Particle Swarm Optimization Algorithm. On initial work area 1 there o-p-q-r-s-o which has 133.5 Km, are several villages such as Mambang Muda TPA - Belungihit Village Aek Hitetoras Brussel Plantation Tapa TPA. And after latest garbage uses PSO algorithm, optimal 132.5 Km o-s-q-r-p-o where village Brussels Landfill. WK 2 an 153.9 Marbau Lobu Rampah Simpang 4 Pernantian and 127.7 Km. 3 150 137.1 127.8 algorithm 149.8 Work 157.8 149.8. 5th working 180.3 134.3 ​​the 5 152.4 152.4.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Particle Swarm Optimization In Solving Capacitated Vehicle Routing Problem

The Capacitated Vehicle Routing Problem (CVRP) is a NP – Complete problem and according to this definition there is no exact solution for it. So researchers try to achieve a near optimum solution for it, by using meta – heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle as a sequence of customers, that vehicle served. We employ Particle Swarm Optimization to solve ...

متن کامل

An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

متن کامل

A particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

متن کامل

Distributed Swarm Optimization Modeling for Waste Collection Vehicle Routing Problem

In this paper, we consider a complex garbage collection problem, where the residents of a particular area dispose of recyclable garbage, which is collected and managed using a fleet of trucks with different weight capacities and volume. This tour is characterized by a set of constraints such as the maximum tour duration (in term of distance and the timing) consumed to collect wastes from severa...

متن کامل

An Improved Particle Swarm Optimization for Vehicle Routing Problem

Vehicle routing problem is a NP-hard problem in combination optimization problem, It is influenced by many factors, and the process is complex. However, the search space of particle swarm algorithm is limited and prone to precocious phenomenon. In this paper, we based on the original particle swarm optimization, present a new way of location update algorithm (VPSO).VPSO in the process of solvin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sinkron : jurnal dan penelitian teknik informatika

سال: 2023

ISSN: ['2541-2019', '2541-044X']

DOI: https://doi.org/10.33395/sinkron.v8i3.12595